Estimation of the modulation index of cpm signals using hos

Three simple methods are proposed for the estimation of the modulation index of continuous phase modulated signals in noise. These methods employ the estimated autocorrelation and fourth-order cumulant sequences of the received signal after sampling at the symbol rate. Analytic expressions are derived for the asymptotic mean and variance of the estimated parameters which are corroborated by means of Monte Carlo simulations. The performance of the methods is illustrated graphically and numerically. It is concluded that, under significant noise degradation, only the scheme based on the fourth-order cumulant sequence can be used to estimate consistently the modulation index h in the range 0(h(1.Peer ReviewedPostprint (published version

Blind multiuser deconvolution in fading and dispersive channels

An adaptive near-far resistant technique for the blind joint multiuser identification and detection in asynchronous CDMA systems is analyzed in fading and dispersive GSM channels.Peer ReviewedPostprint (published version

A relationship between the ideals of Fq[x,y,x−1,y−1]\mathbb{F}_q\left[x, y, x^{-1}, y^{-1} \right] and the Fibonacci numbers

Let $C_n(q)$ be the number of ideals of codimension $n$ of $\mathbb{F}_q\left[x, y, x^{-1}, y^{-1} \right]$, where $\mathbb{F}_q$ is the finite field with $q$ elements. Kassel and Reutenauer [KasselReutenauer2015A] proved that $C_n(q)$ is a polynomial in $q$ for any fixed value of $n \geq 1$. For $q = \frac{3+\sqrt{5}}{2}$, this combinatorial interpretation of $C_n(q)$ is lost. Nevertheless, an unexpected connexion with Fibonacci numbers appears. Let $f_n$ be the $n$-th Fibonacci number (following the convention $f_0 = 0$, $f_1 = 1$). Define the series $$F(t) = \sum_{n \geq 1} f_{2n}\,t^n.$$ We will prove that for each $n \geq 1$, $$C_n\left( \frac{3+\sqrt{5}}{2}\right) = \lambda_n \, \left(f_{2n} \frac{3+\sqrt{5}}{2} - f_{2n-2} \right) ,$$ where the integers $\lambda_n \geq 0$ are given by the following generating function $$ \prod_{m \geq 1} \left(1+F\left( t^m\right)\right) = 1 + \sum_{n \geq 1} \lambda_n\,t^n. $

On prime numbers of the form 2n±k2^n \pm k

Consider the set $\mathcal{K}$ of integers $k$ for which there are infinitely many primes $p$ such that $p+k$ is a power of $2$. The aim of this paper is to show a relationship between $\mathcal{K}$ and the limits points of some set rational numbers related to a sequence of polynomials $C_n(q)$ introduced by Kassel and Reutenauer [KasselReutenauer]

On a function introduced by Erd\"{o}s and Nicolas

Erd\"os and Nicolas [erdos1976methodes] introduced an arithmetical function $F(n)$ related to divisors of $n$ in short intervals $\left] \frac{t}{2}, t\right]$. The aim of this note is to prove that $F(n)$ is the largest coefficient of polynomial $P_n(q)$ introduced by Kassel and Reutenauer [kassel2015counting]. We deduce that $P_n(q)$ has a coefficient larger than $1$ if and only if $2n$ is the perimeter of a Pythagorean triangle. We improve a result due to Vatne [vatne2017sequence] concerning the coefficients of $P_n(q)$

Middle divisors and σ\sigma-palindromic Dyck words

Given a real number $\lambda > 1$, we say that $d|n$ is a $\lambda$-middle divisor of $n$ if $$\sqrt{\frac{n}{\lambda}} < d \leq \sqrt{\lambda n}.$$ We will prove that there are integers having an arbitrarily large number of $\lambda$-middle divisors. Consider the word $$\langle\! \langle n \rangle\! \rangle_{\lambda} := w_1 w_2 ... w_k \in \{a,b\}^{\ast},$$ given by $$w_i := \left\{ \begin{array}{c l} a & \textrm{if } u_i \in D_n \backslash \left(\lambda D_n\right), \\ b & \textrm{if } u_i \in \left(\lambda D_n\right)\backslash D_n, \end{array} \right.$$ where $D_n$ is the set of divisors of $n$, $\lambda D_n := \{\lambda d: \quad d \in D_n\}$ and $u_1, u_2, ..., u_k$ are the elements of the symmetric difference $D_n \triangle \lambda D_n$ written in increasing order. We will prove that the language $$\mathcal{L}_{\lambda} := \left\{\langle\! \langle n \rangle\! \rangle_{\lambda} : \quad n \in \mathbb{Z}_{\geq 1} \right\}$$ contains Dyck words having an arbitrarily large number of centered tunnels. We will show a connection between both results